Compositional Verification of an Object-Based Model for Reactive Systems

نویسندگان

  • M. Sirjani
  • A. Movaghar
  • M. R. Mousavi
چکیده

Reactive systems have an ongoing interaction with their environment, accepting requests and producing responses. Correct and reliable construction of reactive systems is particularly important and challenging. So, using a formal method to establish mathematical proof of correctness of such systems is necessary. A formal method consists of three major components: a model for describing the behavior of the system, a specification language to embody correctness requirements, and an analysis method to verify the behavior against the correctness requirements [8]. We choose an object-based model as the modelling language to describe the system, linear temporal logic as the specification language, and compositional verification for verifying that the model meets its specification. In system verification, a main obstacle to the use of automatic methods is the state-explosion problem, which is the exponential increase in the number of system states caused by a linear increase in the number of system components or variables [6]. Compositional verification attempts to overcome the stateexplosion problem by exploiting the modular structure that is naturally present in many system designs. Compositional verification can decrease the complexity of problem when the model is naturally decomposable [10]. So, a model consisting of inherently independent modules is suitable for compositional verification. Object-based modelling is based on abstraction, encapsulation, and information hiding, using modules with high independence. Therefore, we choose an object-based model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

StateClock: a Tool for Timed Reactive Modules

We provide an overview of the compositional specification and verification tool StateClock using temporal logic and timed object-based visual system descriptions. Verification of the system is performed module by module using model-checking and theorem proving.

متن کامل

Compositional verification for reactive multi-agent systems applied to platoon non collision verification

This paper presents a methodology for the verification of reactive multi-agent systems (RMAS). High level of confidence about a safe operation is a mandatory in many reactive applications. Model-checking appear as an adequate tool for the verification of safety properties. However, model-checking can be confronted with the problem of intractable state space sizes. To avoid this kind of limitati...

متن کامل

Towards a compositional verification approach for multi-agent systems : Application to Platoon system

Résumé. This paper presents a methodology for the verification of reactive multi-agent systems (RMAS). High level of confidence about a safety execution is a must in such systems. For this reason, model-checking appear as an adequate tool to the verification of such models. However, model-checking can be confronted with the problem of huge state space exploration. To avoid this kind of inconven...

متن کامل

Verification of an Evolutionary-based Wavelet Neural Network Model for Nonlinear Function Approximation

Nonlinear function approximation is one of the most important tasks in system analysis and identification. Several models have been presented to achieve an accurate approximation on nonlinear mathematics functions. However, the majority of the models are specific to certain problems and systems. In this paper, an evolutionary-based wavelet neural network model is proposed for structure definiti...

متن کامل

Partial Unfolding for Compositional Nonblocking Verification of Extended Finite-state Machines

This working paper describes a framework for compositional nonblocking verification of reactive systems modelled as extended finite-state machines. The nonblocking property can capture the absence of livelocks and deadlocks in concurrent systems. Compositional verification is shown in previous work to be effective to verify this property for large discrete event systems. Here, these results are...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001